Transition system specifications with negative premises
نویسندگان
چکیده
منابع مشابه
Modular Semantics for Transition System Specifications with Negative Premises
Transition rules with negative premises are needed in the structural operational semantics of programming and specification constructs, such as priority and interrupt, as well as in timed extensions of specification languages. The well-known proof-theoretic semantics for transition system specifications involving negative premises is based on well-supported proofs for closed transitions. Howeve...
متن کاملThe Meaning of Negative Premises in Transition System Specifications II
This paper reviews several methods to associate transition relations to transition system specifications with negative premises in Plotkin’s structural operational style. Besides a formal comparison on generality and relative consistency, the methods are also evaluated on their taste in determining which specifications are meaningful and which are not. Additionally, this paper contributes a pro...
متن کاملTree rules in probabilistic transition system specifications with negative and quantitative premises
Probabilistic transition system specifications (PTSSs) in the ntμfν/ntμxν format provide structural operational semantics for Segala-type systems that exhibit both probabilistic and nondeterministic behavior and guarantee that bisimilarity is a congruence. Similar to the nondeterministic case of the rule format tyft/tyxt, we show that the well-foundedness requirement is unnecessary in the proba...
متن کاملThe Meaning of Negative Premises in Transition System Speci cations II
De nition 2 (Transition system speci cations). Let be a signature. A positive -literal is an expression t a ! t and a negative -literal an expression t 6 a ! or t 6 a ! t with t; t 2 T ( ) and a 2 A. For t; t 2 T ( ) the literals t a ! t and t 6 a !, as well as t a ! t and t 6 a ! t, are said to deny each other. A transition rule over is an expression of the form H with H a set of -literals (th...
متن کاملVariable binding operators in transition system specifications
In this paper the approach to structural operational semantics (SOS) using transition system specifications (TSSs) is extended to deal with variable binding operators and many-sortedness. Bisimulation and Verhoef’s transition rule format, known as the panth format, generalize naturally to the new TSSs. It is shown that in this setting bisimulation is still a congruence for meaningful TSSs in pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1993
ISSN: 0304-3975
DOI: 10.1016/0304-3975(93)90111-6